#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=3e5+100;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
stack<char>s;
char str[maxn];
int main(void)
{
  cin.tie(0);std::ios::sync_with_stdio(false);
  LL n;cin>>n;
  cin>>(str+1);
  LL len=strlen(str+1);
  if(len&1){
    cout<<":("<<"\n";
  }
  else{
    LL num=len/2;
    for(LL i=1;i<=len;i++){
        if(str[i]=='(') num--;
    }
    for(LL i=1;i<=len;i++){
        if(str[i]=='?'&&num>0){
            num--;str[i]='(';
        }
        else if(str[i]=='?') str[i]=')';
    }
    for(LL i=1;i<=len;i++){
        if(!s.empty()&&s.top()=='('&&str[i]==')'){
            s.pop();
            if(s.empty()&&i!=len){
                cout<<":("<<"\n";
                return 0;
            }
            continue;
        }
        s.push(str[i]);
    }
    if(!s.empty()){
        cout<<":("<<"\n";
    }
    else{
        for(LL i=1;i<=len;i++){
            cout<<str[i];
        }
        cout<<"\n";
    }
  }
return 0;
}
